OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
نویسندگان
چکیده
منابع مشابه
OSPF Routing with Optimal Oblivious Performance Ratio Under Polyhedral Demand Uncertainty
We study the best OSPF style routing problem in telecommunication networks, where weight management is employed to get a routing configuration with the minimum oblivious ratio. We consider polyhedral demand uncertainty: the set of traffic matrices is a polyhedron defined by a set of linear constraints, and the performance of each routing is assessed on its worst case congestion ratio for any fe...
متن کاملOblivious OSPF routing with weight optimization under polyhedral demand uncertainty
The desire for configuring well-managed OSPF routes to handle the communication needs in the contemporary business world with larger networks and changing service requirements has opened the way to use traffic engineering tools with the OSPF protocol. Moreover, anticipating possible shifts in expected traffic demands while using network resources efficiently has started to gain more attention. ...
متن کاملOblivious OSPF Routing with Weight Optimization under Polyhedral Demand Uncertainty1
The desire for configuring well-managed OSPF routes to handle today’s communication needs with larger networks and changing service requirements has opened the way to use traffic engineering tools with OSPF protocol. Moreover, anticipating possible shifts in expected traffic demands while using network resources efficiently has started to gain more attention. We consider these two crucial issue...
متن کاملOptimal oblivious routing under statistical uncertainty
In telecommunication networks, a common measure is the maximum congestion (i.e., utilisation) on edge capacity. As traffic demands are often known with a degree of uncertainty, network management techniques must take into account traffic variability. The oblivious performance of a routing is a measure of how congested the network may get, in the worst case, for one of a set of possible traffic ...
متن کاملRobust DWDM Routing and Provisioning under Polyhedral Demand Uncertainty ∗
We present mixed integer linear programming models that are robust in the face of uncertain traffic demands known to lie in a certain polyhedron for the problem of dense wavelength division multiplexing network routing and provisioning at minimal cost. We investigate the solution of the problem in a set of numerical experiments for two models of polyhedral uncertainty: (a) the hose model, (b) a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization and Engineering
سال: 2009
ISSN: 1389-4420,1573-2924
DOI: 10.1007/s11081-009-9098-y